Almost Convex Functions: Conjugacy and Duality
نویسندگان
چکیده
We prove that the formulae of the conjugates of the precomposition with a linear operator, of the sum of finitely many functions and of the sum between a function and the precomposition of another one with a linear operator hold even when the convexity assumptions are replaced by almost convexity or nearly convexity. We also show that the duality statements due to Fenchel hold when the functions involved are taken only almost convex, respectively nearly convex.
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملConjugacy Correspondences : a Unified View
As preparation for a duality theory for saddle programs, a partial conjugacy correspondence is developed among equivalence classes of saddle functions. Three known conjugacy correspondences, including Fenchel's correspondence among convex functions and Rockafellar's extension of it to equivalence classes of saddle functions, are shown to be degenerate special cases. Additionally, two new corres...
متن کاملMin Common/Max Crossing Duality: A Geometric View of Conjugacy in Convex Optimization1
We provide a unifying framework for the visualization and analysis of duality, and other issues in convex optimization. It is based on two simple optimization problems that are dual to each other: the min common point problem and the max crossing point problem. Within the insightful geometry of these problems, several of the core issues in convex analysis become apparent and can be analyzed in ...
متن کاملAlgorithms in Discrete Convex Analysis
This is a survey of algorithmic results in the theory of “discrete convex analysis” for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid-theoretic concepts, in ...
متن کاملOn the Remainder of the First Order Development of Convex Functions
A study of the remainder term in the first order conical development of a convex function is given in the framework of infinite dimensional normed spaces. Lower and upper estimates of this remainder are tackled, and the action of the conjugacy operation on these estimates is characterized. In particular, we shed some light on the duality between the class of conically differentiable convex func...
متن کامل